Lazy Sweep Ray Casting A Fast Scanline Algorithm for Rendering Irregular Grids
نویسندگان
چکیده
For the visualization of three-dimensional data, whether scalar or vector, direct volume rendering has emerged as a leading, and often preferred, method. While surface rendering method can be applied to visualize volumetric data, they require the extraction of some structure, such as isosurfaces or streamlines, which may bias the resulting visualization. In rendering volumetric data directly, we treat space as composed of semi-transparent material that can emit, transmit, and absorb light, thereby allowing one to “see through” (or see inside) the data [4, 3]. Volume rendering also allows one to render surfaces, and, in fact, by changing the properties of the light emission and absorption, different lighting effects can be achieved [2].
منابع مشابه
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids
Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the “disconnectedness” decreases. The algorithm is carefully tailored to explo...
متن کاملParallel Volume Rendering of Irregular Grids Abstract of the Dissertation Parallel Volume Rendering of Irregular Grids
of the Dissertation Parallel Volume Rendering of Irregular Grids by Jos e Cl audio Teixeira e Silva Junior Doctor of Philosophy in Computer Science State University of New York at Stony Brook 1996 This dissertation contains our contributions in methods to speed up volume rendering, an important sub eld of scienti c visualization. We develop a framework composed of a system and a set of algorith...
متن کاملGPU Improvements on the Sorting and Projection of Tetrahedral Meshes for Direct Volume Rendering
Direct Volume Rendering is one of the most popular visualization techniques. Although approaches such as ray-casting or slicing are fast and well-implemented on graphics hardware for regular and irregular grids, cell projection techniques are still time-consuming for large tetrahedral meshes. We propose improvements to the pipeline of cell projection techniques based on the SXMPVO [4] and the P...
متن کاملBounded-Error Interactive Ray Tracing
Ray tracing, which computes radiance, is traditionally regarded as an off-line rendering algorithm that is too slow for interactive use. In this paper, we present an interactive system that uses 4D interpolants to approximate radiance, while providing guaranteed error bounds. Our system exploits the object-space, ray-space, image-space and temporal coherence in radiance to accelerate ray tracin...
متن کاملFast Projection-Based Ray-Casting Algorithm for Rendering Curvilinear Volumes
ÐWe present an efficient and robust ray-casting algorithm for directly rendering a curvilinear volume of arbitrarily-shaped cells. By projecting cell-faces onto the image plane, we have effectively addressed three critical steps of the ray-casting process, namely finding the entry cell-faces for a ray, traversing along the ray from one cell to another, and reconstructing data values at the ray/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007